A Novel Ideal Contrast Visual Secret Sharing Scheme with Reversing
نویسندگان
چکیده
In visual secret sharing (VSS) schemes, a secret image can be visually revealed from overlapping shadow images without additional computations. However, the contrast of reconstructed image is much lost. Employing reversing operation to reverse black and white pixels as well as increasing encoding runs is an effective way to improve the contrast. A novel VSS scheme with reversing is presented in this paper. It achieves really ideal contrast within only / m h ⎡ ⎤ ⎢ ⎥ encoding runs (where m and h are the number of the total columns and the number of the wholewhite columns in the basis matrix to encode white pixels, respectively) and no pixel expansion occurs. It encodes the secret image block by block. A block consists of m pixels, which means that m pixels together join into each encoding step. It is suitable for all access structures and can be applied to encrypt black-white, gray-scale and chromatic images. The experimental results, analyses and comparisons show that the proposed scheme is optimal among those schemes with reversing in encoding runs, pixel expansion, complexity, system capacity and encoding efficiency.
منابع مشابه
Real Perfect Contrast Visual Secret Sharing Schemes with Reversing
The visual secret sharing (VSS for short) scheme is a secret image sharing scheme. A secret image is visually revealed from overlapping shadow images without additional computations. However, the contrast of reconstructed image is much lost. By means of the reversing operation (reverse black and white), Viet and Kurosawa used the traditional VSS scheme to design a VSS scheme which the secret im...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملVisual Secret Sharing Schemes with Cyclic Access Structure for Many Images
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing scheme can be constructed by using Droste’s method. However the contrast of its scheme is 1/(2n). In this paper, it is shown that for every integer n ≥ 4, there exists no construction of such a visual secret sharing s...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Multimedia
دوره 4 شماره
صفحات -
تاریخ انتشار 2009